翻訳と辞書
Words near each other
・ Deterministic acyclic finite state automaton
・ Deterministic algorithm
・ Deterministic automaton
・ Deterministic context-free grammar
・ Deterministic context-free language
・ Deterministic encryption
・ Deterministic finite automaton
・ Deterministic garbage collector
・ Deterministic global optimization
・ Deterministic memory
・ Deterministic noise
・ Deterministic Parallel Java
・ Deterministic parsing
・ Deterministic pushdown automaton
・ Deterministic routing
Deterministic scale-free network
・ Deterministic simulation
・ Deterministic system
・ Deterministic system (philosophy)
・ Detern
・ Deterrence
・ Deterrence (film)
・ Deterrence (legal)
・ Deterrence (psychology)
・ Deterrence theory
・ Deterring Democracy
・ Deterritorial Support Group
・ Deterritorialization
・ Deters
・ Deth


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Deterministic scale-free network : ウィキペディア英語版
Deterministic scale-free network

A scale-free network is type of networks that is of particular interest of network science. It is characterized by its degree distribution following a power law. While the most widely known generative models for scale-free networks are stochastic, such as the Barabási–Albert model or the Fitness model can reproduce many properties of real-life networks by assuming preferential attachment and incremental growth, the understanding of deterministic scale-free networks leads to valuable, analytical results.
==Concept==
Although there are multiple deterministic models to generate scale-free networks, it is common, that they define a simple algorithm of adding nodes, which is then iteratively repeated and thus leads to a complex network. As these models are deterministic, it is possible to get analytic results about the degree distribution, clustering coefficient, average shortest path length, random walk centrality and other relevant network metrics.
Deterministic models are especially useful to explain empirically observed phenomena and demonstrate the existence of networks with certain properties. For example, the Barabási-Albert model predicts a decreasing average clustering coefficient as the number of nodes increases,〔Zadorozhnyi, V.; Yudin, E. Structural properties of the scale-free Barabasi-Albert graph, Automation & Remote Control. Apr 2012, Vol. 73 Issue 4, p702-716.〕 whereas empirical evidence suggests otherwise. Hierarchical network models can explain this phenomenon while also retaining the scale-free property.〔Komjathy, J
Simon, K. Generating hierarchial scale-free graphs from fractals, Chaos Solitions & Fractals; Aug, 2011, 44 8, p651-p666〕 Another notable example is that it is possible to generate networks deterministically, which are scale-free and linear world at the same time, showing that small-world property is not a necessary consequence of the scale-free property.〔Zhu, L-Z., Yin, B-B., Zhao, L., Cai, K-Y. Scale-free networks can be linear-world, International Journal of Modern Physics B: Condensed Matter Physics; Statistical Physics; Applied Physics. 12/30/2011, Vol. 25 Issue 32, p4593-4603〕

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Deterministic scale-free network」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.